Interchangeability for Case Adaptation in Con guration Problems
نویسندگان
چکیده
We address in this paper the adaptation of a case when a complete constraint model of the underlying problem is given. The idea is to apply methods from constraint based reasoning that allows the detection of \similar" solutions, which can be used to adapt a selected case to a new situation. We consider applications like con-guration where a complete constraint model is available. For these applications, it is often advantageous to use a case-based approach because constructing a solution from scratch requires often more interaction than taking a complete solution (case) and adapt it to t the current requirements.
منابع مشابه
Abstraction Techniques for Connguration Systems
ion Techniques for Con guration Systems Rainer Weigel and Boi Faltings DRAFT Laboratoire d'Intelligence Arti cielle Ecole Polytechnique F ed erale de Lausanne (EPFL) IN-Ecublens, CH-1015 Lausanne Switzerland fweigel,[email protected] .ch Abstract In this paper, we address abstraction methods for conguration. Con guration is a design activity where the set of available components and their allowed...
متن کاملSoft Interchangeability for Case Adaptation
In [1] we propose interchangeability based algorithms as methods for solving the case adaptation for the domain of problems which can be expressed as Constraint Satisfaction Problems. In this paper we extend the domain to Soft Constraint Satisfaction Problems and give generic adaptation methods based on soft interchangeability concepts. Many real-life problems require the use of preferences. Th...
متن کاملIntegration of Distributed Constraint-Based Con gurators
Con guration problems are a thriving application area for declarative knowledge representation that experiences a constant increase in size and complexity of knowledge bases. However, today's con gurators are designed for solving local con guration problems not providing any distributed con guration problem solving functionality. Consequently the challenges for the construction of con guration ...
متن کاملCon guration Cloning: Exploiting Regularity in Dynamic DSP Architectures
Existing FPGAs have fairly simple and ine cient con guration mechanisms due to the relative infrequency of recon guration. However a large class of dynamically con gurable architectures for DSP and communications can bene t from special-purpose con guration mechanisms which allow signi cant savings in con guration speed, power and memory. Light weight con guration mechanisms allow much ner grai...
متن کاملCan support systems adversely a!ect cell performance?
This paper aims to determine the e!ect that support systems have upon the productivity of manufacturing systems is demonstrated in this paper. Two case studies were undertaken in two separate factories. The method encompassed: Determining the support system con"guration, identifying signi"cant production problems, problem-solving to identify root cause and the tracking of process routes. Links ...
متن کامل